Discussion on “ Quickest Detection Problems : Fifty Years Later ” by Albert N . Shiryaev

نویسندگان

  • Albert N. Shiryaev
  • Alexander G. Tartakovsky
  • George V. Moustakides
  • Nitis Mukhopadhyay
چکیده

Quickest detection is a fascinating area of sequential analysis that spans across various branches of science and engineering. It is a pleasure to welcome Professor Albert Shiryaev’s article, which provides a comprehensive overview (both scientific and historic) of this area. In this discussion, we expand on some of the issues raised in the article that we believe require further elaboration.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quickest Detection of Drift Change for Brownian Motion in Generalized Bayesian and Minimax Settings

The paper deals with the quickest detection of a change of the drift of the Brownian motion. We show that the generalized Bayesian formulation of the quickest detection problem can be reduced to the optimal stopping problem for a diffusion Markov process. For this problem the optimal procedure is described and its characteristics are found. We show also that the same procedure is asymptotically...

متن کامل

State-of-the-Art in Bayesian Changepoint Detection

We provide a brief overview of the state-of-the-art in quickest (sequential) changepoint detection and present some new results on asymptotic and numerical analysis of main competitors such as the CUSUM, Shiryaev–Roberts, and Shiryaev detection procedures in a Bayesian context.

متن کامل

Quickest Detection with Discretely Controlled Observations

We study a continuous time Bayesian quickest detection problem in which observation times are a scarce resource. The agent, limited to making a finite number of discrete observations, must adaptively decide his observation strategy to minimize detection delay and the probability of false alarm. Under two different models of observation rights, we establish the existence of optimal strategies, a...

متن کامل

Asymptotic Bayesian Theory of Quickest Change Detection for Hidden Markov Models

In the 1960s, Shiryaev developed a Bayesian theory of change-point detection in the i.i.d. case, which was generalized in the beginning of the 2000s by Tartakovsky and Veeravalli for general stochastic models assuming a certain stability of the log-likelihood ratio process. Hidden Markov models represent a wide class of stochastic processes that are very useful in a variety of applications. In ...

متن کامل

General Asymptotic Bayesian Theory of Quickest Change Detection

The optimal detection procedure for detecting changes in independent and identically distributed (i.i.d.) sequences in a Bayesian setting was derived by Shiryaev in the 1960s. However, the analysis of the performance of this procedure in terms of the average detection delay and false alarm probability has been an open problem. In this paper, we develop a general asymptotic change-point detectio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010